Space-E cient Data Cubes for Dynamic Environments

نویسندگان

  • Mirek Riedewald
  • Divyakant Agrawal
  • Amr El Abbadi
  • Renato Pajarola
چکیده

Data cubes provide aggregate information to support the analysis of the contents of data warehouses and databases. An important tool to analyze data in data cubes is the range query. For range queries that summarize large regions of massive data cubes, computing the query result on-they can result in non-interactive response times (e.g., in the order of minutes). To speed up range queries, values that summarize regions of the data cube are pre-computed and stored. This faster response time results in more expensive updates and/or space overhead. While the emphasis is typically on low query and update costs, growing data collections increase the demand for space-e cient approaches. In this paper two techniques are presented that have the same update and query costs as earlier approaches, without introducing any space overhead.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

cient Data Cubes for Dynamic Environments ?

Data cubes provide aggregate information to support the analysis of the contents of data warehouses and databases. An important tool to analyze data in data cubes is the range query. For range queries that summarize large regions of massive data cubes, computing the query result on-they can result in non-interactive response times. To speed up range queries, values that summarize regions of the...

متن کامل

Space-Efficient Data Cubes for Dynamic Environments

Data cubes provide aggregate information to support the analysis of the contents of data warehouses and databases. An important tool to analyze data in data cubes is the range query. For range queries that summarize large regions of massive data cubes, computing the query result on the y can result in non-interactive response times (e.g. in the order of minutes). To speed up range queries, valu...

متن کامل

Efficient Algorithms for Octree Motion

This paper presents e cient algorithms for updating moving octrees. The rst algorithm works for octrees undergoing both translation and rotation motion; it works efciently by compacting source octrees into a smaller set of cubes (not necessarily standard octree cubes) as a precomputation step, and by using a fast, exact cube/cube intersection test between source octree cubes and target octree c...

متن کامل

cient Data Cubes for Dynamic

Data cubes provide aggregate information to support the analysis of the contents of data warehouses and databases. An important tool to analyze data in data cubes is the range query. For range queries that summarize large regions of massive data cubes, computing the query result on the y can result in non-interactive response times (e.g. in the order of minutes). To speed up range queries, valu...

متن کامل

The Z Method for Fast Path Planning in Dynamic Environments

We present a method to plan collision free paths for robots with any number of degrees of freedom in dynamic environments The method proved to be very e cient as it ommits a complete representation of the high di mensional search space Its complexity is linear in the number of degrees of freedom A preprocessing of the geometry data of the robot or the environment is not re quired With the time ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000